The clique operator on cographs and serial graphs
نویسندگان
چکیده
منابع مشابه
Independent sets in edge-clique graphs
We show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in O(n4) time. We show that the independent set problem on edge-clique g...
متن کاملEdge-clique graphs of cocktail parties have unbounded rankwidth
In an attempt to find a polynomial-time algorithm for the edgeclique cover problem on cographs we tried to prove that the edge-clique graphs of cographs have bounded rankwidth. However, this is not the case. In this note we show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth.
متن کاملIndependent sets in edge-clique graphs II
We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in polynomial time. We show that the independent set problem on edge-clique ...
متن کاملAlgorithmic Aspects of Switch Cographs
This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n) decomposition algorithm and we take advantage of the involution modular decomposition tree to state several algorithmic results. Cographs are the graphs that are totally decomposable w.r.t modular decomp...
متن کاملGem- And Co-Gem-Free Graphs Have Bounded Clique-Width
The P4 is the induced path of four vertices. The gem consists of a P4 with an additional universal vertex being completely adjacent to the P4, and the co-gem is its complement graph. Gemand co-gem-free graphs generalize the popular class of cographs (i. e. P4-free graphs). The tree structure and algebraic generation of cographs has been crucial for several concepts of graph decomposition such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 282 شماره
صفحات -
تاریخ انتشار 2004